Informatics Publishing Limited

Shahab Saquib Sohail ¹, Jamshed Siddiqui ¹, Rashid Ali ²

Affiliations
1 Department of Computer Science, Aligarh Muslim University, Aligarh – 202002, Uttar Pradesh, IN
2 Department of Computer Engineering, Aligarh Muslim University, Aligarh – 202002, Uttar Pradesh, IN

Abstract

Objectives: To propose the top books for universities students by using the proposed fuzzy based approach, Ordered Ranked weighted Aggregation method. Methods/Statistical Analysis: The recommendations of books by different universities differ significantly. A staunch aggregation of the differently recommended books by the top ranked universities may lead to vigorous recommendation. We apply Positional Aggregation based Scoring technique, a rank aggregation method for partial list. We have suggested Ordered Ranked Weighted Aggregation (ORWA) operator, which assigns weights to the ranker. Findings: By using proposed technique, the recommendation of top ranked university is preferred over lower ranked universities. The philosophy of ORWA is the fact that the recommendation of a book by a top ranked university will eventually increase the importance of the recommended books. The top 20 books on "Artificial Intelligence" are recommended using PAS and ORWA based techniques. The recommendation would help the users in finding the books of their requirement. Improvements: The relative comparisons between both the discussed techniques PAS and ORWA are discussed and shown graphically. The results indicate a clear improvement of ORWA over PAS.

Keywords

Fuzzy Techniques, OWA, ORWA, Partial List, Recommendation Technique, Rank Aggregation.

Full Text

   

Zaki Ahmad Khan ¹, Jamshed Siddiqui ², Mahfooz Alam ³

Affiliations
1 College of Life Science Nanjing Agricultural University Nanjing, Jiangsu, CN
2 Department of Computer Science, Aligarh Muslim University, Aligarh – 202001, Uttar Pradesh, IN
3 Department of Computer Science, Al- Barkaat College of Graduate Studies, Aligarh – 202002, Uttar Pradesh, IN

Abstract

Objectives: Topropose analgorithm for better performance interms of scheduling and the network usage is economical. Method/Statistical Analysis: The dynamic task scheduling algorithm has been proposed for scheduling the load on numerous cube based multiprocessor interconnection networks. Especially the efficiency of the proposed algorithm is examined in terms of performance parameters for instance Load Imbalance Factor’s as well as Execution Time for cube based multiprocessor networks; Nevertheless, a comparison is created with other standard scheduling algorithm. Findings:The comparative simulation study shows that the proposed algorithm gives better performance in terms of task scheduling on various cube based multiprocessor networks. Application: The study in such a direction implies that the variety of processors in folded hypercube has been decreased thus minimizing the cost as well as intricacy of the network without reducing the efficiency of the network. Therefore, a combination of scalable folded hypercube architecture and efficient proposed algorithm is a better organization model that supports variety of informatics applications.

Keywords

Dynamic Scheduling Algorithm, Hypercube Networks, Interconnection Networks, Minimum Distance Property, Scheduling Performance Parameter

Full Text